Centralized Caching with Unequal Cache Sizes
نویسندگان
چکیده
We address centralized caching problem with unequal cache sizes. We consider a system with a server of files connected through a shared error-free link to a group of cacheenabled users where one subgroup has a larger cache size than the rest. We investigate caching schemes with uncoded cache placement which minimize the load of worst-case demands over the shared link. We propose a caching scheme which improves upon existing schemes by either having a lower worst-case load, or decreasing the complexity of the scheme while performing within 1.1 multiplicative factor suggested by our numerical simulations.
منابع مشابه
Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case
The centralized coded caching problem is studied under heterogeneous cache sizes and channel qualities from the server to the users, focusing on the two-user case. More specifically, a server holding N files is considered to be serving two users with different cache sizes, each requesting a single file, and it is assumed that in addition to the shared common link, each user also has a private l...
متن کاملOn Coded Caching with Heterogeneous Distortion Requirements
This paper considers heterogeneous coded caching where the users have unequal distortion requirements. The server is connected to the users via an error-free multicast link and designs the users’ cache sizes subject to a total memory budget. In particular, in the placement phase, the server jointly designs the users’ cache sizes and the cache contents. To serve the users’ requests, in the deliv...
متن کاملCoded Caching and Content Delivery with Heterogeneous Distortion Requirements
Cache-aided coded content delivery is studied for devices with diverse quality-of-service (QoS) requirements. The network consists of a server, which holds a database of independent contents, and users equipped with local caches of different capacities. User caches are filled by the server during a low traffic period without the knowledge of particular user demands. It is assumed that each user...
متن کاملNoisy Broadcast Networks with Receiver Caching
We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers’ requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with all-equal erasure probabilities and equal cache sizes and a set of strong receivers with all-equal erasure...
متن کاملCaching and Coded Delivery over Gaussian Broadcast Channels for Energy Efficiency
A cache-aided K-user Gaussian broadcast channel (BC) is considered. The transmitter has a library ofN equal-rate files, from which each user demands one. The impact of the equal-capacity receiver cache memories on the minimum required transmit power to satisfy all user demands is studied. Considering uniformly random demands across the library, both the minimum average power (averaged over all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018